3D mesh Reeb graph computation using commute-time and diffusion distances
نویسندگان
چکیده
3D-model analysis plays an important role in numerous applications. In this paper, we present an approach for Reeb graph extraction using a novel mapping function. Our mapping function computes a real value for each vertex which provides interesting insights to describe topology structure of the 3D-model. We perform discrete contour for each vertex according to our mapping function. Topology changes can be detected by discrete contours analysis to construct the Reeb graph. Our mapping function has some important properties. It is invariant to rigid and non rigid transformations, it is insensitive to noise, it is robust to small topology changes, and it does not depend on parameters. From the extracted graph, these properties show the significant parts of a 3D-model. We retain the evaluation criteria to the properties of the mapping function, and compared them to those used in the state of the art. In the end, we present extracted Reeb graph on various models with different positions.
منابع مشابه
STAR - Laplacian Spectral Kernels and Distances for Geometry Processing and Shape Analysis
In geometry processing and shape analysis, several applications have been addressed through the properties of the spectral kernels and distances, such as commute-time, biharmonic, diffusion, and wave distances. Our survey is intended to provide a background on the properties, discretization, computation, and main applications of the Laplace-Beltrami operator, the associated differential equatio...
متن کاملSimplified Reeb Graph as Effective Shape Descriptor for the Striatum
In this work, we present a novel image and mesh processing pipeline for the computation of simplified Reeb graphs for closed triangle meshes of the human striatum extracted from 3D-T1 weighted MR images. The method uses active contours for computing the mesh partition and the simplified Reeb graph. Experimental results showed that simplified Reeb graphs, as obtained by our pipeline, provide an ...
متن کامل3D Mesh Skeleton Extraction Using Topological and Geometrical Analyses
This paper describes a novel and unified approach for Reeb graph construction and simplification as well as constriction approximation on 3D polygonal meshes. The key idea of our algorithm is that discrete contours – curves carried by the edges of the mesh and approximating the continuous contours of a mapping function – encode both topological and geometrical shape characteristics. Firstly, me...
متن کاملRepresenting Roots on the Basis of Reeb Graphs in Plant Phenotyping
This paper presents a new representation for root images based on Reeb graphs. The representation proposed captures lengths and distances in root structures as well as locations of branches, numbers of lateral roots and the locations of the root tips. An analysis of root images using Reeb graphs is presented and results are compared to ground truth measurements. This paper shows, that the Reeb ...
متن کاملExploring the use of Reeb graphs in LOD generation
Level of detail was one of the fundamental solutions of simplification 3D scene. But some issues with this solution are present. For example the topology of the mesh is not kept. In this paper we introduce the Reeb graph in level of detail. Reeb graph is a topological extractor for graph. We extract the most important point of a mesh and use them as LOD. These points are representing by a skele...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012